Homological Dehn Functions and the Word Problem

نویسنده

  • S. M. Gersten
چکیده

S. M. Gersten Abstract. Homological Dehn functions over R and over Z are introduced to measure minimal fillings of integral 1-cycles by (real or integral) 2-chains in the Cayley 2complex of a finitely presented group. If the group G is the fundamental group of a finite graph of finitely presented vertex-groups Hv and finitely generated edge-groups, then there is a formula for an isoperimetric function (for genus 0 fillings) for G in terms of the real homological Dehn function for G and the (genus 0) Dehn functions for the Hv . Hierarchies of groups are introduced in which an isoperimetic function is determined by a formula in terms of the real homological Dehn function. In such a hierarchy the word problem is one of homological algebra. All 1-relator groups are in such a hierarchy. Applications are given to the generalized word problem (a.k.a. membership or Magnus problem) and to a homolgical determination of distortion.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Dehn Functions of Infinite Presentations of Groups

We introduce two new types of Dehn functions of group presentations which seem more suitable (than the standard Dehn function) for infinite group presentations and prove the fundamental equivalence between the solvability of the word problem for a group presentation defined by a decidable set of defining words and the property of being computable for one of the newly introduced functions (this ...

متن کامل

Algorithms, Dehn Functions, and Automatic Groups

Ever since it was shown in the mid 1980s that being word hyperbolic was equivalent to the existence of a linear time solution to the word problem, computational and algorithmic issues have been intimately intertwined with geometric and topological ones in the study of infinite groups. The scope of this chapter is indicated by the three topics in its title: algorithms, Dehn functions, and automa...

متن کامل

On Dehn Functions of Finitely Presented Bi-Automatic Monoids

For each automatic monoid the word problem can be solved in quadratic time (Campbell et al 1996), and hence, the Dehn function of a nitely presented automatic monoid is recursive. Here we show that this result on the Dehn function cannot be improved in general by presenting nitely presented bi-automatic monoids the Dehn functions of which realize arbitrary complexity classes that are suuciently...

متن کامل

Ackermannian Integer Compression and the Word Problem for Hydra Groups

For a finitely presented group, the word problem asks for an algorithm which declares whether or not words on the generators represent the identity. The Dehn function is a complexity measure of a direct attack on the word problem by applying the defining relations. Dison and Riley showed that a “hydra phenomenon” gives rise to novel groups with extremely fast growing (Ackermannian) Dehn functio...

متن کامل

Taming the hydra: the word problem and extreme integer compression

For a finitely presented group, the word problem asks for an algorithm which declares whether or not words on the generators represent the identity. The Dehn function is a complexity measure of a direct attack on the word problem by applying the defining relations. Dison & Riley showed that a “hydra phenomenon” gives rise to novel groups with extremely fast growing (Ackermannian) Dehn functions...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999